package leetcode.code617.MergeTwoBinaryTrees;

import leetcode.helper.tree.TreeNode;

public class Solution61701 extends MergeTwoBinaryTrees {

	@Override
	public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
		if (root1 == null)
			return root2;
		if (root2 == null)
			return root1;
		TreeNode root = new TreeNode(root1.val + root2.val);
		root.left = mergeTrees(root1.left, root2.left);
		root.right = mergeTrees(root1.right, root2.right);
		return root;
	}

//	private TreeNode tree(TreeNode root1, TreeNode root2) {
//		int val = 0;
//		TreeNode root = new TreeNode(val);
//		root.left = tree();
//		root.left = tree();
//		return root;
//	}

	public static void main(String[] args) {
		Solution61701 so = new Solution61701();
		so.debug1();
	}

}
